┌ Warning: Module Symbolics with build ID fafbfcfd-011a-198d-0000-0c25e359d248 is missing from the cache.
│ This may mean Symbolics [0c5d862f-8b57-4792-8d23-62f2024744c7] does not support precompilation but is imported by a module that does.
└ @ Base loading.jl:1793
WARNING: using OrdinaryDiffEq.isconstant in module ModelingToolkit conflicts with an existing identifier.
WARNING: using OrdinaryDiffEq.islinear in module ModelingToolkit conflicts with an existing identifier.
┌ Error: Error during loading of extension SparseDiffToolsSymbolicsExt of SparseDiffTools, use `Base.retry_load_extensions()` to retry.
│   exception =
│    1-element ExceptionStack:
│    Declaring __precompile__(false) is not allowed in files that are being precompiled.
│    Stacktrace:
│      [1] _require(pkg::Base.PkgId, env::Nothing)
│        @ Base ./loading.jl:1825
│      [2] _require_prelocked(uuidkey::Base.PkgId, env::Nothing)
│        @ Base ./loading.jl:1660
│      [3] _require_prelocked(uuidkey::Base.PkgId)
│        @ Base ./loading.jl:1658
│      [4] run_extension_callbacks(extid::Base.ExtensionId)
│        @ Base ./loading.jl:1255
│      [5] run_extension_callbacks(pkgid::Base.PkgId)
│        @ Base ./loading.jl:1290
│      [6] run_package_callbacks(modkey::Base.PkgId)
│        @ Base ./loading.jl:1124
│      [7] _tryrequire_from_serialized(modkey::Base.PkgId, path::String, ocachepath::String, sourcepath::String, depmods::Vector{Any})
│        @ Base ./loading.jl:1398
│      [8] _require_search_from_serialized(pkg::Base.PkgId, sourcepath::String, build_id::UInt128)
│        @ Base ./loading.jl:1494
│      [9] _require(pkg::Base.PkgId, env::String)
│        @ Base ./loading.jl:1783
│     [10] _require_prelocked(uuidkey::Base.PkgId, env::String)
│        @ Base ./loading.jl:1660
│     [11] macro expansion
│        @ ./loading.jl:1648 [inlined]
│     [12] macro expansion
│        @ ./lock.jl:267 [inlined]
│     [13] require(into::Module, mod::Symbol)
│        @ Base ./loading.jl:1611
│     [14] include(mod::Module, _path::String)
│        @ Base ./Base.jl:457
│     [15] include(x::String)
│        @ ModelingToolkit ~/.julia/packages/ModelingToolkit/okjHa/src/ModelingToolkit.jl:4
│     [16] top-level scope
│        @ ~/.julia/packages/ModelingToolkit/okjHa/src/ModelingToolkit.jl:124
│     [17] include
│        @ ./Base.jl:457 [inlined]
│     [18] include_package_for_output(pkg::Base.PkgId, input::String, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::String)
│        @ Base ./loading.jl:2049
│     [19] top-level scope
│        @ stdin:3
│     [20] eval
│        @ ./boot.jl:370 [inlined]
│     [21] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)
│        @ Base ./loading.jl:1903
│     [22] include_string
│        @ ./loading.jl:1913 [inlined]
│     [23] exec_options(opts::Base.JLOptions)
│        @ Base ./client.jl:305
│     [24] _start()
│        @ Base ./client.jl:522
└ @ Base loading.jl:1261
┌ Warning: The call to compilecache failed to create a usable precompiled cache file for ModelingToolkit [961ee093-0014-501f-94e3-6117800e7a78]
│   exception = Required dependency Symbolics [0c5d862f-8b57-4792-8d23-62f2024744c7] failed to load from a cache file.
└ @ Base loading.jl:1818
WARNING: using OrdinaryDiffEq.islinear in module ModelingToolkit conflicts with an existing identifier.
WARNING: using OrdinaryDiffEq.isconstant in module ModelingToolkit conflicts with an existing identifier.
┌ Info: 
└   FUNCTION_NAME = "find_identifiable_functions"
┌ Info: 
└   PROBLEM_NAME = "SEAIJRC Covid model"
┌ Info: 
└   KWARGS = (with_states = true, strategy = (:normalforms, 2))
┌ Info: 
└   GLOBAL_ID = Symbol("(:normalforms, 2)_with_states")
[ Info: Summary of the model:
[ Info: State variables: S, E, A, I, J, C, Ninv
[ Info: Parameters: b, alpha, g2, k, g1, q, r
[ Info: Inputs: 
[ Info: Outputs: y, y2
[ Info: Summary of the model:
[ Info: State variables: x1, x2
[ Info: Parameters: a, b, d, c
[ Info: Inputs: 
[ Info: Outputs: y
[ Info: Computing IO-equations
┌ Info: Computed in 37.990983157 seconds
│   :ioeq_time = :ioeq_time
└   ioeq_time = 37.990983157
[ Info: Computing Wronskians
┌ Info: Computed in 21.817572619 seconds
│   :wrnsk_time = :wrnsk_time
└   wrnsk_time = 21.817572619
[ Info: Dimensions of the Wronskians [1282, 1]
┌ Info: Ranks of the Wronskians computed in 0.896873537 seconds
│   :rank_time = :rank_time
└   rank_times = 0.896873537

⌜ # Computing specializations..  	 Time: 0:00:13[K
✓ # Computing specializations..  	 Time: 0:00:14[K

⌜ # Computing specializations..  	 Time: 0:00:00[K
⌝ # Computing specializations..  	 Time: 0:00:00[K
⌟ # Computing specializations..  	 Time: 0:00:01[K
⌞ # Computing specializations..  	 Time: 0:00:01[K
⌜ # Computing specializations..  	 Time: 0:00:01[K
✓ # Computing specializations..  	 Time: 0:00:01[K

⌜ # Computing specializations.. 	 Time: 0:00:00[K
  Points:  2[K
[K[A
⌝ # Computing specializations.. 	 Time: 0:00:00[K
  Points:  4[K
[K[A
⌟ # Computing specializations.. 	 Time: 0:00:01[K
  Points:  6[K
[K[A
⌞ # Computing specializations.. 	 Time: 0:00:01[K
  Points:  8[K
[K[A
⌜ # Computing specializations.. 	 Time: 0:00:01[K
  Points:  10[K
[K[A
⌝ # Computing specializations.. 	 Time: 0:00:02[K
  Points:  12[K
[K[A
⌟ # Computing specializations.. 	 Time: 0:00:02[K
  Points:  14[K
[K[A
⌞ # Computing specializations.. 	 Time: 0:00:02[K
  Points:  16[K
[K[A
⌜ # Computing specializations.. 	 Time: 0:00:03[K
  Points:  18[K
[K[A
⌝ # Computing specializations.. 	 Time: 0:00:03[K
  Points:  20[K
[K[A
⌟ # Computing specializations.. 	 Time: 0:00:03[K
  Points:  22[K
[K[A
⌞ # Computing specializations.. 	 Time: 0:00:04[K
  Points:  24[K
[K[A
✓ # Computing specializations.. 	 Time: 0:00:04[K
[ Info: Simplifying identifiable functions
┌ Info: Computing parametric Groebner basis up to degrees (2, 2)
│ Ordering, input / target: degrevlex / InputOrdering
│ Rational interpolator: VanDerHoevenLecerf
│ Polynomial interpolator: PrimesBenOrTiwari
│ Estimate degrees: true
└ Assess correctness: false
┌ Info: Basis interpolated exponents summary:
│ Maximal interpolated degrees are: 2 for num. and 2 for den.
│ Maximal number of interpolated terms are: 2 for num. and 2 for den.
└ Points used: 24.
[ Info: Groebner basis computed in 23.921068314 seconds
[ Info: Checking two-sided inclusion modulo a prime
[ Info: Inclusion checked in 10.120221205 seconds. Result: true
[ Info: The coefficients of the Groebner basis are presented by 10 rational functions
┌ Info: Final cleaning and simplification of generators. 
└ Out of 6 fractions 6 are syntactically unique.
[ Info: Checking inclusion with probability 0.995
[ Info: Inclusion checked in 35.595747739 seconds. Result: true
[ Info: Out of 1464 initial generators there are 6 indepdendent
[ Info: The ranking of the new set of generators is 1750
[ Info: Simplifying identifiable functions
┌ Info: Computing parametric Groebner basis up to degrees (2, 2)
│ Ordering, input / target: degrevlex / InputOrdering
│ Rational interpolator: VanDerHoevenLecerf
│ Polynomial interpolator: PrimesBenOrTiwari
│ Estimate degrees: true
└ Assess correctness: false
┌ Info: Basis interpolated exponents summary:
│ Maximal interpolated degrees are: 2 for num. and 1 for den.
│ Maximal number of interpolated terms are: 2 for num. and 2 for den.
└ Points used: 20.
[ Info: Groebner basis computed in 0.869028638 seconds
[ Info: Checking two-sided inclusion modulo a prime
[ Info: Inclusion checked in 0.015689321 seconds. Result: true
[ Info: The coefficients of the Groebner basis are presented by 17 rational functions
┌ Info: Computing normal forms (probabilistic)
│ Variables (14 in total): Nemo.QQMPolyRingElem[b, alpha, g2, k, g1, q, r, S, E, A, I, J, C, Ninv]
│ Up to degree: 2
└ Modulo: Finite field of characteristic 1073741827
[ Info: Used specialization points: 31
┌ Info: Final cleaning and simplification of generators. 
└ Out of 25 fractions 14 are syntactically unique.
[ Info: Checking inclusion with probability 0.995
[ Info: Inclusion checked in 0.030300362 seconds. Result: true
[ Info: Out of 14 initial generators there are 13 indepdendent
[ Info: The ranking of the new set of generators is 318
[ Info: The search for identifiable functions concluded in 158.693012687 seconds
[ Info: Processing SEAIJRC Covid model
┌ Info: Averaging over 1 runs.
│ Using keyword arguments:
│ NamedTuple{(:with_states, :strategy), Tuple{Bool, Tuple{Symbol, Int64}}}
│ (with_states = true, strategy = (:normalforms, 2))
└ ID: (:normalforms, 2)_with_states
[ Info: Computing IO-equations
┌ Info: Computed in 22.165127019 seconds
│   :ioeq_time = :ioeq_time
└   ioeq_time = 22.165127019
[ Info: Computing Wronskians
┌ Info: Computed in 10.034975461 seconds
│   :wrnsk_time = :wrnsk_time
└   wrnsk_time = 10.034975461
[ Info: Dimensions of the Wronskians [1282, 1]
┌ Info: Ranks of the Wronskians computed in 0.673468484 seconds
│   :rank_time = :rank_time
└   rank_times = 0.673468484

⌜ # Computing specializations..  	 Time: 0:00:02[K
✓ # Computing specializations..  	 Time: 0:00:02[K

⌜ # Computing specializations..  	 Time: 0:00:00[K
⌝ # Computing specializations..  	 Time: 0:00:00[K
⌟ # Computing specializations..  	 Time: 0:00:01[K
⌞ # Computing specializations..  	 Time: 0:00:01[K
⌜ # Computing specializations..  	 Time: 0:00:01[K
✓ # Computing specializations..  	 Time: 0:00:01[K

⌜ # Computing specializations.. 	 Time: 0:00:00[K
  Points:  2[K
[K[A
⌝ # Computing specializations.. 	 Time: 0:00:00[K
  Points:  4[K
[K[A
⌟ # Computing specializations.. 	 Time: 0:00:01[K
  Points:  6[K
[K[A
⌞ # Computing specializations.. 	 Time: 0:00:01[K
  Points:  8[K
[K[A
⌜ # Computing specializations.. 	 Time: 0:00:01[K
  Points:  10[K
[K[A
⌝ # Computing specializations.. 	 Time: 0:00:02[K
  Points:  12[K
[K[A
⌟ # Computing specializations.. 	 Time: 0:00:02[K
  Points:  14[K
[K[A
⌞ # Computing specializations.. 	 Time: 0:00:02[K
  Points:  16[K
[K[A
⌜ # Computing specializations.. 	 Time: 0:00:03[K
  Points:  18[K
[K[A
⌝ # Computing specializations.. 	 Time: 0:00:03[K
  Points:  20[K
[K[A
⌟ # Computing specializations.. 	 Time: 0:00:04[K
  Points:  22[K
[K[A
⌞ # Computing specializations.. 	 Time: 0:00:04[K
  Points:  24[K
[K[A
✓ # Computing specializations.. 	 Time: 0:00:04[K
[ Info: Simplifying identifiable functions
┌ Info: Computing parametric Groebner basis up to degrees (2, 2)
│ Ordering, input / target: degrevlex / InputOrdering
│ Rational interpolator: VanDerHoevenLecerf
│ Polynomial interpolator: PrimesBenOrTiwari
│ Estimate degrees: true
└ Assess correctness: false
┌ Info: Basis interpolated exponents summary:
│ Maximal interpolated degrees are: 2 for num. and 2 for den.
│ Maximal number of interpolated terms are: 2 for num. and 2 for den.
└ Points used: 24.
[ Info: Groebner basis computed in 10.772932369 seconds
[ Info: Checking two-sided inclusion modulo a prime
[ Info: Inclusion checked in 5.447440952 seconds. Result: true
[ Info: The coefficients of the Groebner basis are presented by 10 rational functions
┌ Info: Final cleaning and simplification of generators. 
└ Out of 6 fractions 6 are syntactically unique.
[ Info: Checking inclusion with probability 0.995
[ Info: Inclusion checked in 30.268024114 seconds. Result: true
[ Info: Out of 1464 initial generators there are 6 indepdendent
[ Info: The ranking of the new set of generators is 1750
[ Info: Simplifying identifiable functions
┌ Info: Computing parametric Groebner basis up to degrees (2, 2)
│ Ordering, input / target: degrevlex / InputOrdering
│ Rational interpolator: VanDerHoevenLecerf
│ Polynomial interpolator: PrimesBenOrTiwari
│ Estimate degrees: true
└ Assess correctness: false
┌ Info: Basis interpolated exponents summary:
│ Maximal interpolated degrees are: 2 for num. and 1 for den.
│ Maximal number of interpolated terms are: 2 for num. and 2 for den.
└ Points used: 20.
[ Info: Groebner basis computed in 0.179462154 seconds
[ Info: Checking two-sided inclusion modulo a prime
[ Info: Inclusion checked in 0.016398101 seconds. Result: true
[ Info: The coefficients of the Groebner basis are presented by 17 rational functions
┌ Info: Computing normal forms (probabilistic)
│ Variables (14 in total): Nemo.QQMPolyRingElem[b, alpha, g2, k, g1, q, r, S, E, A, I, J, C, Ninv]
│ Up to degree: 2
└ Modulo: Finite field of characteristic 1073741827
[ Info: Used specialization points: 31
┌ Info: Final cleaning and simplification of generators. 
└ Out of 25 fractions 14 are syntactically unique.
[ Info: Checking inclusion with probability 0.995
[ Info: Inclusion checked in 0.030839954 seconds. Result: true
[ Info: Out of 14 initial generators there are 13 indepdendent
[ Info: The ranking of the new set of generators is 318
[ Info: The search for identifiable functions concluded in 85.125647665 seconds
┌ Info: Result is
│   result =
│    13-element Vector{AbstractAlgebra.Generic.Frac{Nemo.QQMPolyRingElem}}:
│     Ninv
│     C
│     J
│     I
│     ⋮
│     S*r
│     A*q
└     (A*r)//(r - 1)
